Exact Dichotomy-based Constrained Encoding
نویسندگان
چکیده
Constrained encoding has several applications in the synthesis of finite state machines (FSMs). E.g., it can be used to generate asynchronous FSM state assignment that guarantees a critical hazard-free implementation, or to generate synchronous FSM state assignment with minimum PLA implementation. This paper presents ZEDICHO, an original zero-suppressed binary decision diagram (ZBDD) based algorithm that solves exactly the dichotomy-based constrained encoding problem.
منابع مشابه
Solving Dichotomy-based Constrained Encoding With Twin Graph Coloring
Constrained encoding consists of finding a minimum length state encoding that meets some requirements. Dichotomy-based constrained encoding is more general than other constrained encoding frameworks, but it is also more difficult to solve in practice. This paper introduces a new formalization of this problem, which reduces it to what we call a twin graph coloring. This new problem leads to orig...
متن کاملSelection Graph Coloring: Application to Constrained Encoding
This paper aims at introducing the concept of selection graph with an application to a non-trivial problem. A selection graph is made of a set of classes, each class having multiple realizations, and of an uncompatibility graph built on these realizations. Coloring a selection graph can be used to solve constrained scheduling, constrained ressource allocation, and dichotomy-based constrained en...
متن کاملAn efficient algorithm for constrained encoding and its applications
Abstracr-In this paper, an efficient algorithm and its implementation ENCORE are presented for finding approximate solutions to dichotomy-based constrained encoding, a problem fundamental to the synthesis of combinational logic circuits, and synchronous and asynchronous sequential circuits. ENCORE adopts a greedy strategy to find an encoding bit by bit, and then uses an iterative method to impr...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کامل